Tractable Classes for Directional Resolution
نویسنده
چکیده
The original, resolution-based Davis-Putnam satisfiability algorithm (Davis & Putnam 1960) was recently revived by (Dechter & Rish 1994) under the name “directional resolution” (DR). We provide new positive complexity results for DR. First, we identify a class of theories (ACT, Acyclic Component Theories), which includes many real-world theories, for which DR takes polynomial time. Second, we present an improved analysis of the complexity of directional resolution through refined notions of induced width, which yields new tractable classes for DR, and much better predictions of its space and time requirements under various atom orderings. These estimates can be used for heuristically choosing among various orderings before running DR.
منابع مشابه
Directional Resolution: The Davis-Putnam Procedure, Revisited
The paper presents algorithm directional resolution, a variation on the original DavisPutnam algorithm, and analyzes its worstcase behavior as a function of the topological structure of the theories. The notions of induced width and diversity are shown to play a key role in bounding the complexity of the procedure. The importance of our analysis lies in highlighting structure-based tractable cl...
متن کاملOn Broken Triangles
A binary CSP instance satisfying the broken-triangle property (BTP) can be solved in polynomial time. Unfortunately, in practice, few instances satisfy the BTP. We show that a local version of the BTP allows the merging of domain values in arbitrary instances of binary CSP, thus providing a novel polynomial-time reduction operation. Extensive experimental trials on benchmark instances demonstra...
متن کاملA Microstructure-Based Family of Tractable Classes for CSPs
The study of tractable classes is an important issue in Artificial Intelligence, especially in Constraint Satisfaction Problems. In this context, the Broken Triangle Property (BTP) is a state-of-the-art microstructure-based tractable class which generalizes well-known and previously-defined tractable classes, notably the set of instances whose constraint graph is a tree. In this paper, we propo...
متن کاملTractable Probabilistic Knowledge Bases: Wikipedia and Beyond
Building large-scale knowledge bases from a variety of data sources is a longstanding goal of AI research. However, existing approaches either ignore the uncertainty inherent to knowledge extracted from text, the web, and other sources, or lack a consistent probabilistic semantics with tractable inference. To address this problem, we present a framework for tractable probabilistic knowledge bas...
متن کاملTo Guess or to Think? Hybrid Algorithms for SAT
Complete algorithms for solving propositional satis ability fall into twomain classes: backtracking (e.g., the Davis-Putnam Procedure [4]) and resolution (e.g., Directional Resolution [9]). Roughly speaking, backtracking amounts to \guessing" (making assumption), while resolution invokes \thinking" (inference). Experimental results show that both \pure guessing" and \pure thinking" might be ine...
متن کامل